Enhancing data locality of the conjugate gradient method for high-order matrix-free finite-element implementations

نویسندگان

چکیده

This work investigates a variant of the conjugate gradient (CG) method and embeds it into context high-order finite-element schemes with fast matrix-free operator evaluation cheap preconditioners like matrix diagonal. Relying on data-dependency analysis appropriate enumeration degrees freedom, we interleave vector updates inner products in CG iteration matrix-vector product only minor organizational overhead. As result, around 90% entries three active vectors are transferred from slow RAM memory exactly once per iteration, all additional access hitting cache memory. Node-level performance analyses scaling studies up to 147k cores show that proposed optimizations is two times faster than standard solver as well optimized pipelined s-step methods for large sizes exceed processor caches, provides similar near strong limit.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

buckling of viscoelastic composite plates using the finite strip method

در سال های اخیر، تقاضای استفاده از تئوری خطی ویسکوالاستیسیته بیشتر شده است. با افزایش استفاده از کامپوزیت های پیشرفته در صنایع هوایی و همچنین استفاده روزافزون از مواد پلیمری، اهمیت روش های دقیق طراحی و تحلیل چنین ساختارهایی بیشتر شده است. این مواد جدید از خودشان رفتارهای مکانیکی ارائه می دهند که با تئوری های الاستیسیته و ویسکوزیته، نمی توان آن ها را توصیف کرد. این مواد، خواص ویسکوالاستیک دارند....

Global conjugate gradient method for solving large general Sylvester matrix equation

In this paper, an iterative method is proposed for solving large general Sylvester matrix equation $AXB+CXD = E$, where $A in R^{ntimes n}$ , $C in R^{ntimes n}$ , $B in R^{stimes s}$ and  $D in R^{stimes s}$ are given matrices and $X in R^{stimes s}$  is the unknown matrix. We present a global conjugate gradient (GL-CG) algo- rithm for solving linear system of equations with multiple right-han...

متن کامل

Conjugate gradient method - Wikipedia, the free encyclopedia

In mathematics, the conjugate gradient method is an algorithm for the numerical solution of particular systems of linear equations, namely those whose matrix is symmetric and positive-definite. The conjugate gradient method is often implemented as an iterative algorithm, applicable to sparse systems that are too large to be handled by a direct implementation or other direct methods such as the ...

متن کامل

Spectral Finite Element Method for Free Vibration of Axially Moving Plates Based on First-Order Shear Deformation Theory

In this paper, the free vibration analysis of moderately thick rectangular plates axially moving with constant velocity and subjected to uniform in-plane loads is investigated by the spectral finite element method. Two parallel edges of the plate are assumed to be simply supported and the remaining edges have any arbitrary boundary conditions. Using Hamilton’s principle, three equations of moti...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of High Performance Computing Applications

سال: 2022

ISSN: ['1741-2846', '1094-3420']

DOI: https://doi.org/10.1177/10943420221107880